Command injection attacks, continuations, and the Lambek calculus
نویسنده
چکیده
This paper shows connections between command injection attacks, continuations, and the Lambek calculus: certain command injections, such as the tautology attack on SQL, are shown to be a form of control effect that can be typed using the Lambek calculus, generalizing the double-negation typing of continuations. Lambek’s syntactic calculus is a logic with two implicational connectives taking their arguments from the left and right, respectively. These connectives describe how strings interact with their left and right contexts when building up syntactic structures. The calculus is a form of propositional logic without structural rules, and so a forerunner of substructural logics like Linear Logic and Separation Logic.
منابع مشابه
Efficient Parsing with the Product-Free Lambek Calculus
This paper provides a parsing algorithm for the Lambek calculus which is polynomial time for a more general fragment of the Lambek calculus than any previously known algorithm. The algorithm runs in worst-case time O(n5) when restricted to a certain fragment of the Lambek calculus which is motivated by empirical analysis. In addition, a set of parameterized inputs are given, showing why the alg...
متن کاملEfficiently Parsing with the Product-Free Lambek Calculus
This paper provides a parsing algorithm for the Lambek calculus which is polynomial time for a more general fragment of the Lambek calculus than any previously known algorithm. The algorithm runs in worst-case time O(n5) when restricted to a certain fragment of the Lambek calculus which is motivated by empirical analysis. In addition, a set of parameterized inputs are given, showing why the alg...
متن کاملParsing CCGbank with the Lambek Calculus
This paper will analyze CCGbank, a corpus of CCG derivations, for use with the Lambek calculus. We also present a Java implementation of the parsing algorithm for the Lambek calculus presented in Fowler (2009) and the results of experiments using that algorithm to parse the categories in CCGbank. We conclude that the Lambek calculus is computationally tractable for this task and provide insight...
متن کاملEliminating the unit constant in the Lambek calculus with brackets
We present a translation of the Lambek calculus with brackets and the unit constant, Lb∗1, into the Lambek calculus with brackets allowing empty antecedents, but without the unit constant, Lb∗. Using this translation, we extend previously known results for Lb∗ to Lb∗1: (1) languages generated by categorial grammars based on the Lambek calculus with brackets are context-free (Kanazawa 2017); (2)...
متن کاملLambek Calculus with Nonlogical Axioms
We study Nonassociative Lambek Calculus and Associative Lambek Calculus enriched with finitely many nonlogical axioms. We prove that the nonassociative systems are decidable in polynomial time and generate context-free languages. In [Buszkowski 1982] it has been shown that finite axiomatic extensions of Associative Lambek Calculus generate all recursively enumerable languages; here we give a ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015